Some scheduling problems with sum of logarithm processing times based learning effect and exponential past sequence dependent delivery times

<p style='text-indent:20px;'>In recent years, significant on the past sequence dependent delivery times have been increasing for scheduling problems. An electronic component when waiting to process may be exposed certain an electromagnetic field and is required neutralize effect of electromagnetism. In this case, it needs extra time eliminate adverse effect. literature, called as past-sequence-dependent times. paper we introduce single-machine problems with exponential sum-of-actual-processing-time-based By times, mean that are defined by function sum actual processing already processed jobs. On other hand, learning reflected in decreasing based job's position schedule. paper, also both where job a logarithm jobs processed. We show minimize makespan, total completion time, weighted maximum tardiness polynomial solutions.</p>